package java5;

import java.util.Arrays;
import java.util.Scanner;

class PersonSortable implements Comparable<PersonSortable> {
	private String name;
	private int age;

	public PersonSortable(String name, int age) {
		this.name = name;
		this.age = age;
	}

	public String toString() {
		return name + "-" + age;
	}

	public String getName() {
		return name;
	}

	public void setName(String name) {
		this.name = name;
	}

	public int getAge() {
		return age;
	}

	public void setAge(int age) {
		this.age = age;
	}

	@Override
	public int compareTo(PersonSortable o) {
		// TODO Auto-generated method stub
		int x = this.getName().compareTo(o.getName());
		if (x != 0) {
			return x;
		}
		return this.getAge() - o.getAge();
	}
}

public class T2 {
	

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		PersonSortable a[] = new PersonSortable[n];
		for (int i = 0; i < n; i++) {
			a[i] = new PersonSortable(sc.next(), sc.nextInt());
		}
		Arrays.sort(a);
		for (int i = 0; i < a.length; i++) {
					System.out.println(a[i]);

		}
		System.out.println(Arrays.toString(PersonSortable.class.getInterfaces()));
	}
}
